Updating Sets of Probabilities
نویسندگان
چکیده
There are several well-known justifications for conditioning as the appropriate method for updating a single probability measure, given an observation. However, there is a significant body of work arguing for sets of probability measures, rather than single mea sures, as a more realistic model of uncer tainty. Conditioning still makes sense in this context-we can simply condition each mea sure in the set individually, then combine the results-and, indeed, it seems to be the pre� ferred updating procedure in the literature. But how justified is conditioning in this richer setting? Here we show, by considering an axiomatic account of conditioning given by van Fraassen, that the single-measure and sets-of-measures cases are very different. We show that van Fraassen's axiomatization for the former case is nowhere near sufficient for updating sets of measures. We give a con siderably longer (and not as compelling) list of axioms that together force conditioning in this setting, and describe other update meth ods that are allowed once any of these axioms is dropped.
منابع مشابه
On Optimal Probabilities in Stochastic Coordinate Descent Methods
We propose and analyze a new parallel coordinate descent method—‘NSync— in which at each iteration a random subset of coordinates is updated, in parallel, allowing for the subsets to be chosen non-uniformly. We derive convergence rates under a strong convexity assumption, and comment on how to assign probabilities to the sets to optimize the bound. The complexity and practical performance of th...
متن کاملCredal Sets Approximation by Lower Probabilities: Application to Credal Networks
Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as constraints defining a second credal set. This simple procedure produces an outer approximation, with a bounded number of extreme points, for general credal sets. The approximation is optimal in the sense that no other lower probabi...
متن کاملModeling Categorical Random Fields via Linear Bayesian Updating
Abstract: Categorical variables are common in spatial data analysis. Traditional analytical methods for deriving probabilities of class occurrence, such as kriging-family algorithms, have been hindered by the discrete characteristics of categorical fields. This study introduces the theoretical backgrounds of linear Bayesian updating (LBU) approach for spatial classification through expert syste...
متن کاملMinimum Information Updating with Specified Marginals in Probabilistic Expert Systems
A probability-updating method in probabilistic expert systems is considered in this paper based on the minimum discrimination information. Here, newly acquired information is taken as the latest true marginal probabilities, not as newly observed data with the same weight as previous data. Posterior probabilities are obtained by updating prior probabilities subject to the latest true marginals. ...
متن کاملMaking Decisions Using Sets of Probabilities: Updating, Time Consistency, and Calibration
We consider how an agent should update her beliefs when her beliefs are represented by a set P of probability distributions, given that the agent makes decisions using the minimax criterion, perhaps the best-studied and most commonly-used criterion in the literature. We adopt a game-theoretic framework, where the agent plays against a bookie, who chooses some distribution from P. We consider tw...
متن کامل